A Triangle-Triangle Intersection Algorithm
نویسندگان
چکیده
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algorithm that can intersect both types of triangles without resorting to special cases. Herein we present a complete design and implementation of a single algorithm independent of the type of intersection. Additionally, this algorithm first detects, then intersects and classifies the intersections using barycentric coordinates. This work is directly applicable to (1) Mobile Network Computing and Spatial Reasoning, and (2) CAD/CAM geometric modeling where curves of intersection between a pair of surfaces is required for numerical control (NC) machines. Three experiments of the algorithm implementation are presented as a proof this feasibility.
منابع مشابه
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether two triangles embedded in three dimensions intersect. Our technique solves the basic sets of linear equations associated with the problem and exploits the strong relations between these sets to speed up their solution. M...
متن کاملTriangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning
In CAD/CAM modeling, objects are represented using the Boundary Representation (ANSI Brep) model. Detection of possible intersection between objects can be based on the objects’ boundaries (i.e., triangulated surfaces), and computed using triangle-triangle intersection. Usually only a cross intersection algorithm is needed; however, it is beneficial to have a single robust and fast intersection...
متن کاملFast Ray-Triangle Intersections by Coordinate Transformation
Ray-triangle intersection is a crucial calculation in ray tracing. We present a new algorithm for finding these intersections, occupying a different place in the spectrum of time-space tradeoffs than existing algorithms do. Our algorithm provides faster ray-triangle intersection calculations at the expense of precomputing and storing a small amount of extra information for each triangle. Runnin...
متن کاملHardware-Accelerated Ray-Triangle Intersection Testing for High-Performance Collision Detection
We present a novel approach for hardware-accelerated collision detection. This paper describes the design of the hardware architecture for primitive inference testing components implemented on a multi-FPGA Xilinx Virtex-II prototyping system. This paper focuses on the acceleration of ray-triangle intersection operation which is the one of the most important operations in various applications su...
متن کاملFast Ray-Triangle Intersection Computation Using Reconfigurable Hardware
We present a novel FPGA-accelerated architecture for fast collision detection among rigid bodies. This paper describes the design of the hardware architecture for several primitive intersection testing components implemented on a multi-FPGA Xilinx Virtex-II prototyping system. We focus on the acceleration of ray-triangle intersection operation which is the one of the most important operations i...
متن کامل